Optimization of Optical Structures Using Markov Decision Processes Tyler Hughes and Yu (Jerry) Shi
نویسنده
چکیده
We present an algorithm for optimizing optical structures based on Markov Decision Processes. Our method is successfully demonstrated on a one-dimensional stack of dielectric slabs, where we wish to choose a combination of slab thicknesses and refractive indices to approximate a target reflection spectrum. We show that this algorithm is less susceptible to being caught in local minimum and has favorable computational scaling as the number of layers is increased.
منابع مشابه
Accelerated decomposition techniques for large discounted Markov decision processes
Many hierarchical techniques to solve large Markov decision processes (MDPs) are based on the partition of the state space into strongly connected components (SCCs) that can be classified into some levels. In each level, smaller problems named restricted MDPs are solved, and then these partial solutions are combined to obtain the global solution. In this paper, we first propose a novel algorith...
متن کاملOptimizing Red Blood Cells Consumption Using Markov Decision Process
In healthcare systems, one of the important actions is related to perishable products such as red blood cells (RBCs) units that its consumption management in different periods can contribute greatly to the optimality of the system. In this paper, main goal is to enhance the ability of medical community to organize the RBCs units’ consumption in way to deliver the unit order timely with a focus ...
متن کاملA General Projection Property for Distribution Families
Surjectivity of linear projections between distribution families with fixed mean and covariance (regardless of dimension) is re-derived by a new proof. We further extend this property to distribution families that respect additional constraints, such as symmetry, unimodality and log-concavity. By combining our results with classic univariate inequalities, we provide new worst-case analyses for ...
متن کاملExistence of Optimal Policies for Semi-Markov Decision Processes Using Duality for Infinite Linear Programming
Semi-Markov decision processes on Borel spaces with deterministic kernels have many practical applications, particularly in inventory theory. Most of the results from general semi-Markov decision processes do not carry over to a deterministic kernel since such a kernel does not provide “smoothness.” We develop infinite dimensional linear programming theory for a general stochastic semi-Markov d...
متن کاملA numerical approach to stochastic reach-avoid problems for Markov Decision Processes
An important problem in stochastic control is the so-called reach-avoid problem where one maximizes the probability of reaching a target set while avoiding unsafe subsets of the state-space. We develop a computational method for the finite horizon reach-avoid problem for discrete-time Markov decision processes. Our approach is based on deriving an infinite dimensional linear program whose solut...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015